#include <execution>
#include <vector>
#include <random>
#include <ctime>
#include <iostream>
#include "QuickSort.hpp"
#include "MergeSort.hpp"
#include "HeapSort.hpp"
#include "ShellSort.hpp"
#include "CountSort.hpp"

using namespace std;
class Solution {
public:
    void print(vector<int>& nums, int n) {
        for (int i = 0; i < n; ++i) {
            cout << nums[i] << ' ';
        }
        cout << endl;
    }

    vector<int> sortArray(vector<int>& nums) {
        // MergeSort(nums);
        // QuickSort(nums);
        // HeapSort(nums);
        //ShellSort(nums);
        // ranges::sort(nums);
        // CountSort(nums);
        // sort(std::execution::par, nums.begin(), nums.end());
        // ShellSort(nums);
        return nums;
    }
};


int main() {
    return 0;
}